International Journal of Advanced Networking and Applications

M. Ramya ¹, K. Kowsalya ¹, V. Ramesh ¹

Affiliations
1 Department of Computer Science, Klasalingam Institute of Technology, Krishnan koil, IN

Abstract

The transmission of a traffic flows with a certain bandwidth demand over a single network path is either not possible or not cost-effective. In these cases, it is veritably periodic usable to improve focus the network's bandwidth appliance by breaking the traffic flow upon multiple qualified paths. Using multiple paths for the equivalent traffic flow increases the certainty of the network, it absorbs deluxe forwarding resources from the network nodes and also it overcomes link failure provide security. In this paper, we illustrate several problems related to splitting a traffic flow over multiple paths while minimizing the absorption of forwarding resources mitigates failures and implementing security.

Keywords

RMO (Routing with Minimum Overhead, DMO (Decomposition with Minimum Overhead), MPC (Multiple Routing Configuration), OSPF (Open Shortest Path).

Full Text

   

K. Kowsalya ¹, V. Ramesh ¹

Affiliations
1 Department of Computer Science and Engineering, Kalasalingam Institute of Technology, Krishnan Koil, IN

Abstract

Cloud computing is an economical and effective solution for sharing group resource among cloud users. Unfortunately, sharing data in a multi-owner manner while protect data and identity privacy from an un trusted cloud is still a challenging issue, due to the recurrent change of the membership.The major aims of this method a secure multi-owner data sharing scheme.That is any user in the group can securely share data with others by un trusted cloud. Moreover, the real identities of data owners can be exposed by the group manager when disputes occur. User revocation can be achieved by a novel revocation list and no need to update the secret Keys of the remaining users.The drawback of IBE is computation over head. To overcome the drawback introduces outsourcing computation.

Keywords

Cloud Computing, Revocation, Multi Owner Data Sharing, Identity Based Encryption.

Full Text

   

V. Ramesh ¹, R. Ananthakumar ¹, S. Kannu Durai ¹

Affiliations
1 Department of Computer Science and Engineering, Kalasalingam Institute of Technology, Tamilnadu, IN

Abstract

Differential testing works by creating test suites for both the original system and the modified system and contrasting both versions of the system with these two suites. Differential testing is made possible by recent advances in automated unit test generation. The differential unit testing is one where developers would like to generate tests that exhibit the behavioral differences between the two versions, if any differences exist. Differential unit tests (DUT) are a combination of unit and system tests. DUTs retain some of the advantages of unit tests, can be automatically and inexpensively generated, and have the potential for revealing faults related to intricate system executions. Some examples of differential unit testing include regression testing, N-version testing, and mutation testing. Differential testing discovered 21%, 34%, and 21% more behavior changes using regression testing techniques than using regression testing alone.

Keywords

Differential Unit Testing, System Testing, Test Cases, Unit Testing.

Full Text

   

V. Ramesh ¹, P. Subbaiah ², K. Sangeetha Supriya ³

Affiliations
1 Sathyabama University, Chennai, IN
2 Veerabrahmendra Institute of Technology & Sciences, Badvel, Kadapa Dt, AP, IN
3 Dept of IT, BVRIT, Narsapur, AP, IN

Abstract

Many research works have already been done for congestion control and resource management in ATM networks using static and dynamic algorithms. However, no comprehensive scheme has been suggested, which can claim optimized the resource allocations fulfilling the requirements of quality of services (QoS) for existing and incoming sources. The paper suggests a new approach, which would make the dynamic allocation of resources by controlling the input rate (λ), output/server rate (μ) and buffer size (χ) individually or in conjunction. The newly proposed approach with dynamical allocation of resources is much more comprehensive in nature and claims a shorter convergence time than the other previously suggested schemes based on similar dynamic allocation principle. In this paper we describe an Adaptive Rate Control (ARC) implemented to improve the performance of high-speed network to handle burst traffic by guaranteeing the cell loss ratio (CLR) for all cell streams. First, the cases in which a Tahoe, Reno, New Reno, SACK and Plain schemes are applicable in peak-cell-rate (PCR) are discussed. The ARC improves the performance by regulating the increment (up) and the decrease (down) of window size (flow control). Incoming traffic rate, number of cell drop, preset size of the window and estimated delay time are taken into account for this regulation. Simulations are used to investigate how Tahoe, Reno, New Reno, SACK and Plain can conduct, as congestion existed. Then we compare these results from four schemes to the “Plain” scheme (no flow control application) and to the proposed ARC. By altering windows size for the mentioned six schemes, we can obtain the supportive results.

Keywords

ARC, Tahoe, Reno, New Reno, SACK, Sliding Windows, ATM network, Quality of Services (QoS), and Comprehensive Dynamic Control Algorithm.

Full Text